On the complexity of constrained VC-classes

نویسنده

  • Joel Ratsaby
چکیده

Sauer’s Lemma is extended to classes HN of binary-valued functions h on [n] = {1, . . . , n} which have a margin less than or equal to N on all x ∈ [n] with h(x) = 1, where the margin μh(x) of h at x ∈ [n] is defined as the largest non-negative integer a such that h is constant on the interval Ia(x) = [x− a, x+ a] ⊆ [n]. Estimates are obtained for the cardinality of classes of binary valued functions with a margin of at least N on a positive sample S ⊆ [n].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sauer's Bound for a Notion of Teaching Complexity

This paper establishes an upper bound on the size of a concept class with given recursive teaching dimension (RTD, a teaching complexity parameter.) The upper bound coincides with Sauer’s well-known bound on classes with a fixed VC-dimension. Our result thus supports the recently emerging conjecture that the combinatorics of VC-dimension and those of teaching complexity are intrinsically interl...

متن کامل

Complexity of VC-classes of sequences with long repetitive runs

The Vapnik-Chervonenkis (VC) dimension (also known as the trace number) and the Sauer-Shelah lemma have found applications in numerous areas including set theory, combinatorial geometry, graph theory and statistical learning theory. Estimation of the complexity of discrete structures associated with the search space of algorithms often amounts to estimating the cardinality of a simpler class wh...

متن کامل

Complexity of Constrained VC-Classes

Let F be a class of n-dimensional binary vectors, i.e., functions f : X → {0, 1} where X = [n] ≡ {1, . . . , n} with a VC-dimension V C(F) = d. The classical result of Sauer says that the complexity of F is bounded as |F| ≤ d i=0 n i ≡ S(d, n). How does the complexity decrease as one further constrains the subset of allowed functions in F ? The paper defines a constraining parameter for binary ...

متن کامل

Exact Learning of First-order Expressions from Queries

This thesis studies the complexity of learning logical expressions in the model of Exact Learning from Membership and Equivalence Queries. The focus is on Horn expressions in first order logic but results for propositional logic are also derived. The thesis includes several contributions towards characterizing the complexity of learning in these contexts. First, a new algorithm for learning fir...

متن کامل

Focus of Attention: a Challenge on Predicting Constrained Action Hypothesis

Focus of attention instruction has a great influence on performance and learning. The purpose of this study was to examine the predicted constrained action hypothesis in badminton backhand serv. 30 women student participants from physical education classes of University of Kharazmi are selected as sample. Participants are tested in probe task at different stage of serve after identifying base o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 156  شماره 

صفحات  -

تاریخ انتشار 2008